A Distributed Algorithm for Minimum Distance-k Domination in Trees
نویسندگان
چکیده
While efficient algorithms for finding minimal distance-k dominating sets exist, finding minimum such sets is NP-hard even for bipartite graphs. This paper presents a distributed algorithm to determine a minimum (connected) distance-k dominating set and a maximum distance-2k independent set of a tree T . It terminates in O(height(T )) rounds and uses O(log k) space. To the best of our knowledge this is the first distributed algorithm that computes a minimum (as opposed to a minimal) distancek dominating set for trees. The algorithm can also be applied to general graphs, albeit the distance-k dominating sets are not necessarily minimal. Submitted: January 2014 Reviewed: June 2014 Revised: July 2014 Reviewed: November 2014 Revised: December 2014 Accepted: March 2015 Final: March 2015 Published: March 2015 Article type: Regular paper Communicated by: S. Whitesides Research funded by Deutsche Forschungsgemeinschaft (DFG), contract number TU 221/6-1 E-mail addresses: [email protected] (Volker Turau) [email protected] (Sven Köhler) 224 Turau et al. Minimum Distance-k Dominating Sets
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملA characterization of trees with equal Roman 2-domination and Roman domination numbers
Given a graph $G=(V,E)$ and a vertex $v in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:Vrightarrow {0,1,2}$ be a function on $G$. The weight of $f$ is $omega(f)=sum_{vin V}f(v)$ and let $V_i={vin V colon f(v)=i}$, for $i=0,1,2$. The function $f$ is said to bebegin{itemize}item a Roman ${2}$-dominating function, if for every vertex $vin V_0$, $sum_{uin N(v)}f(u)geq 2$. The R...
متن کاملExtremal values on Zagreb indices of trees with given distance k-domination number
Let [Formula: see text] be a graph. A set [Formula: see text] is a distance k-dominating set of G if for every vertex [Formula: see text], [Formula: see text] for some vertex [Formula: see text], where k is a positive integer. The distance k-domination number [Formula: see text] of G is the minimum cardinality among all distance k-dominating sets of G. The first Zagreb index of G is defined as ...
متن کاملA Linear-Time Algorithm for 2-Step Domination in Block Graphs
The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O(m) time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees.
متن کاملMixed Roman domination and 2-independence in trees
Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacentor incident to at least one element $yin Vcup E$ for which $f(y)=2$. The weight of anMRDF $f$ is $sum _{xin Vcup E} f(x)$. The mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 19 شماره
صفحات -
تاریخ انتشار 2015